Robust Optimization Solution to Emergency Mobile Facility Fleet Size and Location

Facility Location: A Robust Optimization Approach

I n this research, we apply robust optimization (RO) to the problem of locating facilities in a network facing uncertain demand over multiple periods. We consider a multi-period fixed-charge network location problem for which we find (1) the number of facilities, their location and capacities, (2) the production in each period, and (3) allocation of demand to facilities. Using the RO approach w...

Robust facility location

Let A be a nonempty nite subset of the plane representing the geographical coordinates of a set of demand points (towns,. . .), to be served by a facility, whose location within a given region S is sought. Assuming that the unit cost for a 2 A if the facility is located at x 2 S is proportional to dist(x; a) | the distance from x to a | and that demand of point a is given by ! a , minimizing th...

Approximate robust optimization for the Connected Facility Location problem

In this paper we consider the Robust Connected Facility Location (ConFL) problem within the robust discrete optimization framework introduced by Bertsimas and Sim [7]. We propose an Approximate Robust Optimization (ARO) method that uses a heuristic and a lower bounding mechanism to rapidly find high-quality solutions. The use of a heuristic and a lower bounding mechanism—as opposed to solving t...

Robust Optimization for the Connected Facility Location Problem

Geometric Facility Location Optimization Thesis

This thesis is in Computational Geometry. Computational Geometry is a subfield of Computer Science that deals with problems of a geometric nature that arise in application domains such as Computer Graphics, Robotics, Geographic Information Systems (GIS), and Molecular Biology. More specifically, in this thesis we conduct research in Computational Geometry in the context of (Geometric) Facility ...